If the Parser Fails
نویسندگان
چکیده
The unforgiving nature of natural language components when someone uses an unexpected input has recently been a concern of several projects. For instance, Carbonell (1979) discusses inferring the meaning of new words. Hendrix, e t .a l . (1978) describe a system that provides a means for naive users to define personalized paraphrases and that l i s ts the items expected next at a point where the parser blocks. Weischedel, e t .a l . (1978) show how to relax both syntactic and semantic constraints such that some classes of ungrammatical or semantically inappropriate input are understood. Kwasny aod Sondheimer (1979) present techniques for understanding several classes of syntactically il l-formed input. Codd, e t .a l . (1978) and Lebowitz (1979) present alternatives to top-down, le f t to r igh t parsers as a means of dealing with some of these problems.
منابع مشابه
Feature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملA generalization of Bertrand's test
One of the most practical routine tests for convergence of a positive series makes use of the ratio test. If this test fails, we can use Rabbe's test. When Rabbe's test fails the next sharper criteria which may sometimes be used is the Bertrand's test. If this test fails, we can use a generalization of Bertrand's test and such tests can be continued innitely. For simplicity, we call ratio test,...
متن کاملA Robust Parser Based on Syntactic Information
An extragrammatical sentence is what a normal parser fails to analyze. It is important to recover it using only syntactic information although results of recovery are better if semantic factors are considered. A general algorithm for least-errors recognition, which is based only on syntactic information, was proposed by G. Lyon to deal with the extragrammaticality. We extended this algorithm to...
متن کاملSolutions for Problems of MT Parser. Methods used in Mu-Machine Translation Project
I. Introduction A parser is a key component of a machine translation (MT) system. If it fails in parsing an input sentence , the b~ system cannot output a complete translation. A parser of a practical MT system must solve many problems caused by the varieties of characteristics of natural languages. Some problems are caused by the incompleteness of grammatical rules and dictionary information, ...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملDesign Tool Combining Keyword Analyzer and Case-based Parser for Developing Natural Language Database Interfaces
We have designed and experimentally implemented a tool for developing a natural language systems tha t can accept extra-grammatical expressions, keyword sequences, and linguistic fragments, as well as ordi nary na tura l language queries. The key to this tool 's efficiency is its effective use of a simple keyword analyzer in combination with a conventional case-based parser. TILe keyword analyz...
متن کامل